Resolvability properties via independent families
نویسندگان
چکیده
The authors give a consistent affirmative response to a question of Juhász, Soukup and Szentmiklóssy: If GCH fails, there are (many) extraresolvable, not maximally resolvable Tychonoff spaces. They show also in ZFC that for ω < λ κ , no maximal λ-independent family of λ-partitions of κ is ω-resolvable. In topological language, that theorem translates to this: A dense, ω-resolvable subset of a space of the form (D(λ))I is λ-resolvable. © 2006 Elsevier B.V. All rights reserved. MSC: primary 05A18, 03E05, 54A10; secondary 03E35, 54A25, 05D05
منابع مشابه
Variable-Length Resolvability for General Sources and Channels
We introduce the problem of variable-length source resolvability, where a given target probability distribution is approximated by encoding a variable-length uniform random number, and the asymptotically minimum average length rate of the uniform random numbers, called the (variable-length) resolvability, is investigated. We first analyze the variable-length resolvability with the variational d...
متن کاملThe Independence of Certain Operations on semiAFLS
— It is shown that the opérations of homomorphic replication^ intersection, andKleene* are independent for full semiAFLs. Most of the results depend on known properties of certain families of languages; however, some new families are provided via a diagonal construction.
متن کاملTychonoff expansions with prescribed resolvability properties
Article history: Received 22 January 2009 Accepted 1 December 2009 MSC: primary 05A18, 03E05, 54A10 secondary 03E35, 54A25, 05D05
متن کاملSecrecy from Resolvability
We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of resolvability. Instead of considering capacity-based constructions, which associate to each message a sub-code that operates just below the capacity of the eavesdropper’s channel, we consider resolvability-based constructions, which associate to each message...
متن کاملOuter Bound of the Capacity Region for Identification via Multiple Access Channels
Abstract—In this paper we consider the identification (ID) via multiple access channels (MACs). In the general MAC the ID capacity region includes the ordinary transmission (TR) capacity region. In this paper we discuss the converse coding theorem. We estimate two types of error probabilities of identification for rates outside capacity region, deriving some function which serves as a lower bou...
متن کامل